全文获取类型
收费全文 | 1240篇 |
免费 | 412篇 |
国内免费 | 166篇 |
出版年
2024年 | 2篇 |
2023年 | 9篇 |
2022年 | 19篇 |
2021年 | 28篇 |
2020年 | 21篇 |
2019年 | 12篇 |
2018年 | 14篇 |
2017年 | 46篇 |
2016年 | 76篇 |
2015年 | 69篇 |
2014年 | 122篇 |
2013年 | 66篇 |
2012年 | 125篇 |
2011年 | 112篇 |
2010年 | 66篇 |
2009年 | 120篇 |
2008年 | 92篇 |
2007年 | 102篇 |
2006年 | 99篇 |
2005年 | 106篇 |
2004年 | 83篇 |
2003年 | 63篇 |
2002年 | 59篇 |
2001年 | 56篇 |
2000年 | 48篇 |
1999年 | 44篇 |
1998年 | 43篇 |
1997年 | 20篇 |
1996年 | 22篇 |
1995年 | 8篇 |
1994年 | 20篇 |
1993年 | 10篇 |
1992年 | 9篇 |
1991年 | 9篇 |
1990年 | 8篇 |
1989年 | 8篇 |
1988年 | 2篇 |
排序方式: 共有1818条查询结果,搜索用时 15 毫秒
61.
将仿真决策系统嵌入到指挥控制系统中,利用仿真决策支持正在进行的军事行动正成为未来指挥控制系统发展的重要探索方向。研究了嵌入式仿真决策系统的组成,包括人机接口分系统、在线仿真分系统和控制管理分系统等;研究了嵌入式仿真决策系统的功能,包括计划与方案生成、作战态势读取、辅助指挥决策生成、战场态势预判、行动结果管理与未来态势生成控制等;研究了嵌入的关键技术途径,包括嵌入样式、在线仿真决策技术、定性与定量相结合的在线评估、面向服务的组件化设计等。研究成果对探索和建立我国未来新一代指挥控制系统具有重要、积极的现实和军事意义。 相似文献
62.
顺序输送是利用一条管道输送多种油品,因其可最大限度发挥管道输送潜能而被广泛应用。按照前后行液体不同可分为水顶油、油顶水和不同油品间顺序输送等,其中水顶油顺序输送主要用于管道撤收前的排空作业。对水顶油顺序输送油水混合过程进行了分析,建立了油水混合模型,利用CFD对其进行数值求解,并将仿真结果与前期理论分析进行了对比,两者吻合较好。所得结论可为机动管线水顶油排空作业提供科学指导。 相似文献
63.
采用大涡模拟(LES)对气体羽流分层特性进行数值模拟,分析了基于LES的气体羽流模型、控制方程和数值计算方法,探讨了LES在多组分气体羽流模拟中的应用;以文献[1]中氦气在空气中形成羽流的实验数据为参考,对所建模型进行验证。利用该模型对密闭空间油气泄漏过程进行数值模拟,计算结果表明油气在泄漏发生的240 s之内,不同组分表现出显著不同的分层规律:相对于空气,密度较大的组分聚集在空间下部20%的范围内;密度较小的组分主要分散在空间上部80%的范围内。研究结果为油库油气危险源安全监测与预警、火灾预防与扑救等提供了关键参数参考和工程设计理论依据。 相似文献
64.
65.
Subspace dynamic‐simplex linear interpolation search for mixed‐integer black‐box optimization problems 下载免费PDF全文
Honggang Wang 《海军后勤学研究》2017,64(4):305-322
Design and management of complex systems with both integer and continuous decision variables can be guided using mixed‐integer optimization models and analysis. We propose a new mixed‐integer black‐box optimization (MIBO) method, subspace dynamic‐simplex linear interpolation search (SD‐SLIS), for decision making problems in which system performance can only be evaluated with a computer black‐box model. Through a sequence of gradient‐type local searches in subspaces of solution space, SD‐SLIS is particularly efficient for such MIBO problems with scaling issues. We discuss the convergence conditions and properties of SD‐SLIS algorithms for a class of MIBO problems. Under mild conditions, SD‐SLIS is proved to converge to a stationary solution asymptotically. We apply SD‐SLIS to six example problems including two MIBO problems associated with petroleum field development projects. The algorithm performance of SD‐SLIS is compared with that of a state‐of‐the‐art direct‐search method, NOMAD, and that of a full space simplex interpolation search, Full‐SLIS. The numerical results suggest that SD‐SLIS solves the example problems efficiently and outperforms the compared methods for most of the example cases. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 305–322, 2017 相似文献
66.
Parallel machine scheduling with eligibility constraints: A composite dispatching rule to minimize total weighted tardiness 下载免费PDF全文
We study a parallel machine scheduling problem, where a job j can only be processed on a specific subset of machines Mj, and the Mj subsets of the n jobs are nested. We develop a two‐phase heuristic for minimizing the total weighted tardiness subject to the machine eligibility constraints. In the first phase, we compute the factors and statistics that characterize a problem instance. In the second phase, we propose a new composite dispatching rule, the Apparent Tardiness Cost with Flexibility considerations (ATCF) rule, which is governed by several scaling parameters of which the values are determined by the factors obtained in the first phase. The ATCF rule is a generalization of the well‐known ATC rule which is very widely used in practice. We further discuss how to improve the dispatching rule using some simple but powerful properties without requiring additional computation time, and the improvement is quite satisfactory. We apply the Sequential Uniform Design Method to design our experiments and conduct an extensive computational study, and we perform tests on the performance of the ATCF rule using a real data set from a large hospital in China. We further compare its performance with that of the classical ATC rule. We also compare the schedules improved by the ATCF rule with what we believe are Near Optimal schedules generated by a general search procedure. The computational results show that especially with a low due date tightness, the ATCF rule performs significantly better than the well‐known ATC rule generating much improved schedules that are close to the Near Optimal schedules. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 249–267, 2017 相似文献
67.
68.
69.
70.